FOV-equivalent block triangular preconditioners for generalized saddle-point problems
نویسندگان
چکیده
منابع مشابه
Preconditioners for Generalized Saddle-point Problems Preconditioners for Generalized Saddle-point Problems *
We examine block-diagonal preconditioners and efficient variants of indefinite preconditioners for block two-by-two generalized saddle-point problems. We consider the general, nonsymmetric, nonsingular case. In particular, the (1,2) block need not equal the transposed (2,1) block. Our preconditioners arise from computationally efficient splittings of the (1,1) block. We provide analyses for the...
متن کاملPreconditioners for Generalized Saddle-Point Problems
We propose and examine block-diagonal preconditioners and variants of indefinite preconditioners for block two-by-two generalized saddle-point problems. That is, we consider the nonsymmetric, nonsingular case where the (2,2) block is small in norm, and we are particularly concerned with the case where the (1,2) block is different from the transposed (2,1) block. We provide theoretical and exper...
متن کاملOn block diagonal and block triangular iterative schemes and preconditioners for stabilized saddle point problems
We review the use of block diagonal and block lower/upper triangular splittings for constructing iterative methods and preconditioners for solving stabilized saddle point problems. We introduce new variants of these splittings and obtain new results on the convergence of the associated stationary iterations and new bounds on the eigenvalues of the corresponding preconditioned matrices. We furth...
متن کاملBlock LU Preconditioners for Symmetric and Nonsymmetric Saddle Point Problems
In this paper, a block LU preconditioner for saddle point problems is presented. The main diierence between the approach presented here and that of other studies is that an explicit, accurate approximation of the Schur complement matrix is eeciently computed. This is used to compute a preconditioner to the Schur complement matrix that in turn deenes a preconditioner for a global iteration. The ...
متن کاملA New Analysis of Block Preconditioners for Saddle Point Problems
We consider symmetric saddle point matrices. We analyze block preconditioners based on the knowledge of a good approximation for both the top left block and the Schur complement resulting from its elimination. We obtain bounds on the eigenvalues of the preconditioned matrix that depend only of the quality of these approximations, as measured by the related condition numbers. Our analysis applie...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics Letters
سال: 2018
ISSN: 0893-9659
DOI: 10.1016/j.aml.2017.06.018